class test4
{
      public static void isPrime(int from,int to)
	{
		int countp=0;
		for(int i=from;i<=to;i++)
	    {
		for(int j=1;j<=i;j++)
		{
				if(i%j==0)
					countp++;
		}
		if(countp<=2)
			printprime(i);
		countp=0;			
	    }
		
	}
	
	public static void printprime(int n)
     {
         System.out.println(n);
	
	
     }
}